منابع مشابه
Vizing’s Theorem and Edge-chromatic Graph Theory
This paper is an expository piece on edge-chromatic graph theory. The central theorem in this subject is that of Vizing. We shall then explore the properties of graphs where Vizing’s upper bound on the chromatic index is tight, and graphs where the lower bound is tight. Finally, we will look at a few generalizations of Vizing’s Theorem, as well as some related conjectures.
متن کاملBoundary-connectivity via Graph Theory
We generalize theorems of Kesten and Deuschel-Pisztora about the connectedness of the exterior boundary of a connected subset of Zd, where “connectedness” and “boundary” are understood with respect to various graphs on the vertices of Zd. These theorems are widely used in statistical physics and related areas of probability. We provide simple and elementary proofs of their results. It turns out...
متن کاملBoundary chromatic polynomial
We consider proper colorings of planar graphs embedded in the annulus, such that vertices on one rim can take Qs colors, while all remaining vertices can take Q colors. The corresponding chromatic polynomial is related to the partition function of a boundary loop model. Using results for the latter, the phase diagram of the coloring problem (with real Q and Qs) is inferred, in the limits of two...
متن کاملGraph-chromatic Implicit Relations
A theory about the implication structure in graph coloring is presented. Discovering hidden relations is a crucial activity in every scientific discipline. The development of mathematical models to study and discover such hidden relations is of the most highest interest. The main contribution presented in this work is a model of hidden relations materialized as implicitedges and implicit-identi...
متن کاملtotal dominator chromatic number of a graph
given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1973
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1973-13216-1